Modeling of period overlapping setup times
نویسنده
چکیده
Setup operations play an important role in many production environments. In this paper, the exact modeling of setup times is motivated and two mixed integer programming model formulations are proposed. These model formulations allow the representation of ‘‘long’’ setup times with respect to the length of a planning period, which are widespread in process industries. Computational results underscore the importance of careful modeling of setup times and demonstrate the capabilities of the two proposed model formulations. 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Setup times optimization with considering maintenance scheduling by using nonlinear modeling
The present paper, titled “optimizing the time of preparation, taking into account the timing of repair and maintenance using non-linear modeling”, has been implemented with the aim of designing and presenting a mathematical model to get the best sequence of operations leading to minimum the total time of production. The main research question is related to the reduction of time and productio...
متن کاملCapacitated lot-sizing and scheduling with sequence-dependent, period-overlapping and non-triangular setups
In production planning, sequence dependent setup times and costs are often incurred for switchovers from one product to another. When setup times and costs do not respect the triangular inequality, a situation may occur where the optimal solution includes more than one batch of the same product in a single period — in other words, at least one sub tour exists in the production sequence of that ...
متن کاملAn Effective Hybrid Genetic Algorithm for Hybrid Flow Shops with Sequence Dependent Setup Times and Processor Blocking
Hybrid flow-shop or flexible flow shop problems have remained subject of intensive research over several years. Hybrid flow-shop problems overcome one of the limitations of the classical flow-shop model by allowing parallel processors at each stage of task processing. In many papers the assumptions are generally made that there is unlimited storage available between stages and the setup times a...
متن کاملMinimizing the maximum tardiness and makespan criteria in a job shop scheduling problem with sequence dependent setup times
The job shop scheduling problem (JSP) is one of the most difficult problems in traditional scheduling because any job consists of a set operations and also any operation processes by a machine. Whereas the operation is placed in the machine, it is essential to be considering setup times that the times strongly depend on the various sequencing of jobs on the machines. This research is developed ...
متن کاملMulti-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints
This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 174 شماره
صفحات -
تاریخ انتشار 2006